Drift Analysis and Evolutionary Algorithms Revisited
نویسندگان
چکیده
منابع مشابه
Drift Analysis and Evolutionary Algorithms Revisited
One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function f : {0, 1}n → R. The algorithm starts with a random search point ξ ∈ {0, 1}n, and in each round it flips each bit of ξ with probability c/n independently at random, where c > 0 is a fixed constant. The thus created offspring ξ replaces ξ if and only if...
متن کاملDrift analysis and average time complexity of evolutionary algorithms
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including conditions under which an EA will take no more than polynomial time (in problem size) to solve a prob...
متن کاملDrift and Genome Complexity Revisited
1 Department of Ecology and Evolutionary Biology, Rice University, Houston, Texas, United States of America, 2 Department of Integrative Biology, University of California Berkeley, Berkeley, California, United States of America, 3 Laboratoire de Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, UMR5558, Villeurbanne, France, 4 Department of Biology, Luther College, D...
متن کاملEvolutionary Drift and Equilibrium Selection
This paper develops an approach to equilibrium selection in game theory based on studying . the learning process through which equilibrium is achieved. The differential equations derived from models of interactive learning typically have stationary states that are not isolated. Instead, Nash equilibria that specify different out-of-equilibrium behaviour appear in connected components of station...
متن کاملAnalysis and Applications of Evolutionary Multiobjective Optimization Algorithms Analysis and Applications of Evolutionary Multiobjective Optimization Algorithms
This thesis deals with the analysis and application of evolutionary algorithms for optimization problems with multiple objectives. Many application problems involve (i) a system model that is not given in closed analytical form and (ii) multiple, often conflicting optimization criteria. Both traits hamper the appli¬ cation of classical optimization techniques, which require a certain structure ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2018
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548318000275